Undirected Graphs and Networks Networks and graphs A network is a collection of objects connected to each other in some specific way. A graph is a finite set of dots called vertices (or nodes) connected by links called e

Source URL: www.di-mgt.com.au

• Graph connectivity
• Graph coloring
• Hamiltonian path
• Eulerian path
• Path
• Graph
• Spanning tree
• Tree
• Route inspection problem
• Graph theory
• Theoretical computer science
• NP-complete problems

JSS Journal of Statistical Software MMMMMM YYYY, Volume VV, Issue II. http://www.jstatsoft.org/

Source URL: jung.sourceforge.net

• JUNG
• Adjacency list
• Vertex
• Shortest path problem
• Neighbourhood
• Path
• Clique
• Edge coloring
• Graph theory
• Mathematics
• Graph

Microsoft Word - Hoek_122011.docx

Source URL: www.cmu.edu

• Infographics
• Graph drawing
• Network theory
• Networks
• Topological graph theory
• Topology
• Visualization
• Diagram
• Shortest path problem
• Graph theory
• Mathematics
• Science

A QUERY LANGUAGE SOLUTION FOR SHORTEST PATH PROBLEMS IN CYCLIC GEOMETRIES J.A. Bakker and J.H. ter Bekke Delft University of Technology Faculty of Electrical Engineering, Mathematics and Computer Science E-mail: {J.A.Bak

Source URL: www.kbs.twi.tudelft.nl

• Network theory
• Shortest path problem
• Directed acyclic graph
• Directed graph
• Graph
• Null graph
• Tree
• Graph theory
• Mathematics
• Theoretical computer science

Linking Network Structure and Diffusion through Stochastic Dominance PJ Lamberson MIT Sloan School of Management Abstract Recent research identifies stochastic dominance as critical for

Source URL: pjlamberson.org

• Social networks
• Networks
• Complex network
• Degree distribution
• Stochastic dominance
• Small world experiment
• Diffusion
• Mean-preserving spread
• Average path length
• Graph theory
• Network theory
• Decision theory

How to transform a List Coloring problem into a Traveling Salesman one DRAFT[removed]removed] Abstract This paper describes a method to transform a List Coloring Problem (LCP) into a Traveling

Source URL: clerc.maurice.free.fr

• NP-complete problems
• Travelling salesman problem
• Graph coloring
• Hamiltonian path
• Connectivity
• Edge coloring
• Bellman–Ford algorithm
• Graph theory
• Theoretical computer science
• Mathematics

Finding an Euler Path To find an Euler path for the graph below: Vertices B and C are the only two of odd degree; therefore an Euler path must start and end at these vertices. Add a dummy edge BC to join these two vertic

Source URL: www.di-mgt.com.au

Visibility Graph Theory for Polygons Subir Kumar Ghosh

Source URL: www.tcs.tifr.res.in

• Interval graph
• Graph
• Induced path
• Chordal graph
• Academy Fantasia
• Season 6
• Path decomposition
• Graph theory
• Clique
• Neighbourhood

11276_2007_45_14_5-web[removed]

Source URL: distcomp.ethz.ch

• Routing algorithms
• Network theory
• Wireless networking
• Routing protocols
• NP-complete problems
• Geographic routing
• Routing
• Shortest path problem
• Unit disk graph
• Graph theory
• Mathematics
• Theoretical computer science

Optimal Gradient Clock Synchronization in Dynamic Networks Fabian Kuhn Christoph Lenzen

Source URL: distcomp.ethz.ch

• Theoretical computer science
• Synchronization
• Network theory
• Clock signal
• Clock skew
• Flow network
• Connectivity
• Shortest path problem
• Clock synchronization
• Graph theory
• Mathematics
• Network flow